Doubly stochastic matrices which have certain diagonals with constant sums
نویسندگان
چکیده
منابع مشابه
Subdirect sums of doubly diagonally dominant matrices
The problem of when the k-subdirect sum of a doubly diagonally dominant matrix (DDD matrix) is also a DDD matrix is studied. Some sufficient conditions are given. The same situation is analyzed for diagonally dominant matrices and strictly diagonally dominant matrices. Additionally, some conditions are also derived when card(S)>card(S1) which was not studied by Bru, Pedroche and Szyld [Electron...
متن کاملConditional Autoregressions with Doubly Stochastic Weight Matrices
A conditional spatial autoregression (CAR) specifies dependence via a weight matrix. Employing a doubly stochastic weight matrix allows users to interpret the CAR prediction rule as a semiparametric prediction rule and as BLUP with smoothing in addition to other benefits. We examine standard and doubly stochastic weight matrices in the context of an illustrative data set to demonstrate feasibil...
متن کاملScalings of Matrices Which Have Prespecified Row Sums and Column Sums via Optimization
The problem of scaling a matrix so that it has given row and column sums is transformed into a convex minimization problem. In particular, we use this transformation to characterize the existence of such scaling or corresponding approximations. We obtain new results as well as new, streamlined proofs of known results.
متن کاملDoubly stochastic matrices of trees
In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...
متن کاملRandom doubly stochastic tridiagonal matrices
Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T ∈ Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements abo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1977
ISSN: 0024-3795
DOI: 10.1016/0024-3795(77)90021-0